Efficient computation of multiple environments ( reference implementation )

نویسنده

  • Robert N. C. Pfeifer
چکیده

where the input parameters are specified as follows: tensorList is a 1× n cell array containing the n tensors which make up the tensor network. envList is a 1 × n array of integers. If an entry in envList is non-zero then the environment of the corresponding tensor is computed and returned in the specified output variable. For example, if the tensor list is {A,B,C,D,E} and envList is [0 2 0 0 1] then multienv() will return two tensors env1 and env2 corresponding to the environments of tensors E and B respectively. If an integer is repeated, the corresponding environments are added together. Thus an envList of [0 1 0 0 1] would cause multienv() to return a single tensor, being the sum of the environments of B and E. legLinks describes the tensor network using the leglabelling notation given in Ref. 1. In brief, the tensor network is represented using the customary diagrammatic notation (for which a summary may be found in Ref. 2) and an integer label is assigned to each index (represented in the diagram by a leg). Summed indices are associated with positive integer labels, while open indices are associated with negative integer labels. In the present context it is required that the tensor network have no open indices, so only positive integer labels are required. The variable legLinks is then a 1 × n cell array with each entry being a row vector whose entries are the integer labels associated with the corresponding tensor. The ordering of these labels matches the ordering of the indices on the corresponding tensor in Matlab. For example, Fig. 1(i) shows a closed diagram from the 3:1 1D MERA where all indices have been labelled with positive integers. A convention is adopted for relating the diagrammatic indices to indices in Matlab, whereby the indices of a specific Matlab tensor are associated with specific legs on the diagram. This is illustrated in Fig. 1(ii), where (for example) the topmost leg on tensor A is asFIG. 1. (i) A closed tensor network diagram arising in the optimization of the 3:1 1D MERA. (ii) Ordering of indices on the tensors of diagram (i). Ordering for B is the same as for A. Ordering for D and E is the same as for C. Ordering for H is the same as for G. Note that ordering for tensor F differs from C, D, and E because tensor F is customarily obtained from tensor C in the 3:1 1D MERA by complex conjugation and vertical reflection, and the process of reflection affects the leg ordering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

TensorFlow Agents: Efficient Batched Reinforcement Learning in TensorFlow

We introduce TensorFlow Agents, an efficient infrastructure paradigm for building parallel reinforcement learning algorithms in TensorFlow. We simulate multiple environments in parallel, and group them to perform the neural network computation on a batch rather than individual observations. This allows the TensorFlow execution engine to parallelize computation, without the need for manual synch...

متن کامل

Designing an adaptable heterogeneous abstract machine by means of reflection

The concepts of abstract and virtual machines have been used for many different purposes to obtain diverse benefits such as code portability, compiler simplification, interoperability, distribution and direct support of specific paradigms. Despite of these benefits, the main drawback of virtual machines has always been execution performance. Consequently, there has been considerable research ai...

متن کامل

Semi-Symbolic Computation of Efficient Controllers in Probabilistic Environments

We present a semi-symbolic algorithm for synthesizing efficient controllers in a stochastic environment, implemented as an add-on to the probabilistic model checker PRISM. The user specifies the environment and the controllable actions using a Markov Decision Process (MDP), modeled in the PRISM language. Controller efficiency is defined with respect to a user-specified assignment of costs and r...

متن کامل

MIMO Frequency Domain Iterative Tuning for Tracking Control

A new ’model-free’ iterative controller tuning method is presented for multiple-input multiple output control systems based estimation algorithms in the frequency domain. The method relies on efficient computation of the negative gradient of the controller cost function in the frequency domain. Only one experiment is used per iteration and the method is therefore suitable for realtime implement...

متن کامل

al3c: high-performance software for parameter inference using Approximate Bayesian Computation

MOTIVATION The development of Approximate Bayesian Computation (ABC) algorithms for parameter inference which are both computationally efficient and scalable in parallel computing environments is an important area of research. Monte Carlo rejection sampling, a fundamental component of ABC algorithms, is trivial to distribute over multiple processors but is inherently inefficient. While developm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014